Diffusions on Graphs , Poisson Problems and Spectral Geometry
نویسندگان
چکیده
We study diffusions, variational principles and associated boundary value problems on directed graphs with natural weightings. We associate to certain subgraphs (domains) a pair of sequences, each of which is invariant under the action of the automorphism group of the underlying graph. We prove that these invariants differ by an explicit combinatorial factor given by Stirling numbers of the first and second kind. We prove that for any domain with a natural weighting, these invariants determine the eigenvalues of the Laplace operator corresponding to eigenvectors with nonzero mean. As a specific example, we investigate the relationship between our invariants and heat content asymptotics, expressing both as special values of an analog of a spectral zeta function.
منابع مشابه
Stochastic Processes and Control for Jump-Diffusions∗
An applied compact introductory survey of Markov stochastic processes and control in continuous time is presented. The presentation is in tutorial stages, beginning with deterministic dynamical systems for contrast and continuing on to perturbing the deterministic model with diffusions using Wiener processes. Then jump perturbations are added using simple Poisson processes constructing the theo...
متن کاملA Limit Theorem for Diffusions on Graphs with Variable Configuration
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and configuration of graphs, where the processes are set on. The explicit formulae for the parameters of asymmetry for the vertices of the limiting graph are given in th...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملMarkov Chain Methods for Analyzing Urban Networks
Complex transport networks abstracted as graphs (undirected, directed, or multicomponent) can be effectively analyzed by random walks (or diffusions). We have unified many concepts into one framework and studied in details the structural and spectral properties of spatial graphs for five compact urban patterns.
متن کاملNonlinearity and Temporal Dependence
Nonlinearities in the drift and diffusion coefficients influence temporal dependence in scalar diffusion models. We study this link using two notions of temporal dependence: β − mixing and ρ − mixing. We show that β − mixing and ρ − mixing with exponential decay are essentially equivalent concepts for scalar diffusions. For stationary diffusions that fail to be ρ−mixing, we show that they are s...
متن کامل